Recovering Consistency by Forgetting Inconsistency
نویسندگان
چکیده
In this paper, we introduce and study a new paraconsistent inference relation |=c in the setting of 3-valued paraconsistent logics. Using inconsistency forgetting as a key mechanism for recovering consistency, it guarantees that the deductive closure Cn|=c(Σ) of any belief base Σ is classically consistent and classically closed. This strong feature, not shared by previous inference relations in the same setting, allows to interpret an inconsistent belief base as a set of classical worlds (hence to reason classically from them).
منابع مشابه
Reasoning under inconsistency: A forgetting-based approach
In this paper, a fairly general framework for reasoning from inconsistent propositional basesis defined. Variable forgetting is used as a basic operation for weakening pieces of infor-mation so as to restore consistency. The key notion is that of recoveries, which are sets ofvariables whose forgetting enables restoring consistency. Several criteria for defining pre-ferred recove...
متن کاملForgetting and Conflict Resolving in Disjunctive Logic Programming
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one of our results shows that our notion of forgetting is completely captured by the classical forgetting. A transformation-based algorithm is also developed for computing the result of forgetting. We also provide an anal...
متن کاملMultiple states based temporal consistency for dynamic verification of fixed-time constraints in Grid workflow systems
To verify fixed-time constraints in Grid workflow systems, consistency and inconsistency conditions have been defined in conventional verification work. However, with a view of the run-time uncertainty of activity completion duration, we argue that, although the conventional consistency condition is feasible, the conventional inconsistency condition is too restrictive and covers several differe...
متن کاملRecovering from Inconsistency in Distributed Simple Temporal Networks
Simple Temporal Networks (STNs) are frequently used in scheduling applications, as they provide a powerful and general tool for managing temporal constraints. One obstacle to their use in multi-agent scheduling contexts, however, is the additional problem of maintaining consistency across agent models. Like in centralized applications, unexpected execution results (e.g., an activity taking long...
متن کاملMultiple Consistency States of Fixed-time Constraints in Grid Workflow Systems
To verify fixed-time constraints in grid workflow systems, the consistency and the inconsistency conditions have been defined in the conventional verification work. However, with a view of the run-time uncertainty of the activity completion duration, we argue that although the conventional consistency condition is fine, the conventional inconsistency condition is too rigorous and covers several...
متن کامل